Informatics Publishing Limited

R. Navaneetha ¹, K. S. Roopa ¹, A. M. Natarajan ²

Affiliations
1 Department of Home Science, Smt. V. H. D. Central Institute of Home Science, Seshadri Road, Bangalore, IN
2 Research and Development Centre K. C Das Pvt. Ltd. Bangalore, IN

Abstract

The study was undertaken with an objective to develop diabetic friendly rasogolla using a suitable fat and sugar replacer. Experiments were carried out in developing and standardising a proper combination of various low calorie sugar substitutes from the available array of artificial sweeteners, intense sweeteners and sugar replacers (namely polyols) to reduce the calories. Diabetic friendly rasogolla was developed and standardised using chhana made from skim milk supplemented with a fat replacer in the form of creamex (0.6 %); boiled in sorbitol syrup; washed in water; suspended in a combination of sugar replacers (isomalt&sorbitol at 15 per cent and 25 per cent proportion respectively) which compared very well with control on sensory evaluation by a panel of judges. The combination of sugar replacers (isomalt&sorbitol) proved to be ideal in providing viscosity, texture, colour and taste almost similar to control prepared with sucrose. Creamex used as a fat replacer with skim milk, provided good texture, taste and above all sponginess to low calorie rasogolla. Chemical and microbiological quality of the standardised low calorie rasogolla was assessed and is within the standard limits. Use of other sugar substitutes such as fructose (natural sugar) and artificial sweeteners (aspartame, saccharine or a combination) proved to be unsatisfactory in rasogolla making due to the presence of browning and white cloudiness in the syrup besides poor viscosity. The other major advantages of using sugar replacers (polyols/sugar alcohols) in the traditional sweets was enhancement of shelf-life at room temperature due to restricted growth of residual micro-organisms in the presence of unfermentable low calorie sugar replacers during storage. Polyols are non-cariogenic (sugar-free, tooth-friendly), low glycemic (potentially helpful in diabetes and cardiovascular disease), low-energy and low insulinaemic (helpful in obesity), low digestible (helpful in the colon), prebiotic effect (growth promoter of lactic acid bacteria in the gut). Only 50 per cent of energy of polyols are available to the human body when compared to sucrose. Isomalt requires 5 hours for hydrolysis and the absorption rate has been reported to be very low.

Keywords

No keywords

Full Text

     

M. Pushpavalli ¹, E. Dinesh ², A. M. Natarajan ³

Affiliations
1 Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, Sathyamangalam, IN
2 Department of Applied Electronics, Bannari Amman Institute of Technology, Sathyamangalam, IN
3 Bannari Amman Institute of Technology, Sathyamangalam, IN

Abstract

An attractive mobile ad-hoc network is the collection of mobile nodes that can communicate among themselves within multi-hop with no infrastructure between them. MANET has issues like limited resources, mobility, limited and shared bandwidth. Hence routing becomes difficult and the requirement of QoS raised numerous challenging issues in MANETs. The QoS is not satisfied due to NP complete problem. Hence to satisfy these network constraints we introduce a novel method to find the feasible path that has sufficient resources. Our method includes a multi-objective genetic algorithm and it optimizes parameters like delay and bandwidth. For optimizing we use the QoS aware routing protocol as OLSR considering its MPR sets to find path between source and destination. By using this optimization technique the congestion in the network is minimized and packet delivery ratio is improved.

Keywords

GA, OLSR Protocol, MPR Selection Algorithm, Delay and Bandwidth.

Full Text

     

N. Premalatha ¹, A. M. Natarajan ²

Affiliations
1 Department of Computer Science and Engineering, Kongu Engineering College, Perundurai, IN
2 Bannari Amman Institute of Technology, Sathyamangalam, IN

Abstract

A medium access control (MAC) protocol decides when competing nodes may access the radio channel, and tries to ensure that no two nodes are interfering with each other’s transmissions. In this paper we propose a QoS model for wireless ad hoc networks. Unlike other models it provides stochastic end to end delay guarantees using a routing protocol called GPSR (Greedy Perimeter Stateless Routing) protocol. After the routing is over the packets transmission is done through CTMAC (Concurrent Transmission MAC) protocol with fragmentation. The packets are transmitted concurrently where concurrent transmission is possible. CTMAC inserts additional control gap between the transmission of control packets (RTS/CTS) and data packets (DATA/ACK), which allows a series of RTS/CTS exchanges to take place between the nodes in the vicinity of the transmitting, or receiving node to schedule possible multiple, concurrent data transmissions. It completely utilizes the channel bandwidth and increase the fairness of each flow without causing congestion. This increases the throughput. The results shows us that the throughput of QoS model, where network flow is identified using GPSR protocol and packets are transmitted through CTMAC protocol with fragmentation, is increased when compared with the throughput of CTMAC protocol alone.

Keywords

Wireless, Congestion Control, MAC Protocol, QOS Enhancement, Fragmentation, CTMAC Protocol, Throughput, GPSR.

Full Text

     

C. Poongodi ¹, A. M. Natarajan ², R. C. Suganthe ³

Affiliations
1 Department of Information Technology, Kongu Engineering College, Perundurai, IN
2 Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, IN
3 Computer Science Engineering Department, Kongu Engineering College, IN

Abstract

In challenging network scenarios like battlefield and disaster recovery scenarios, nodes suffer from frequent network partitions and intermittent connectivity. In these scenarios instantaneous end-to-end path between the sender and receiver will not exist due to link breakdown, less battery or mobility of nodes. To address these challenges in challenged networks, DTN architecture with store and forward mechanism is already proposed. But, the existing routing protocols proposed for DTN fails to address the bundle forwarding when a node is out its own network. Therefore the delay in message delivery increases further. Also it lacks for centralized control and scalability problems. Here we propose, an enhanced bundle delivery routing protocol with cluster head for DTN to address the above issues.

Keywords

Bundle, Challenged Networks, Delay Tolerant Networks, Name Tuple, Message Switching.

Full Text

     

S. Varadhaganapathy ¹, A. M. Natarajan ²

Affiliations
1 Department of Information Technology, Kongu Engineering College, Perundurai, Erode, Tamilnadu,, IN
2 Bannari Amman Institute of Technology, Sathyamangalam, Tamilnadu, IN

Abstract

An Ad hoc network is a collection of wireless computers (nodes) communicating among themselves over multi-hop paths. Also it is an infrastructure-less network which has dynamic topology, organized by itself and can be easily deployed with minimum configuration. These are the constraints which draw the attention and importance of ad hoc networks in defense applications. In recent years, security in ad hoc networks becomes an exiting and interesting research topic that has started to receive attention from a number of researchers. Several routing protocols for ad hoc networks have been proposed, but most of them failed to consider the security problem. In this paper, Triple Hash Technique (THT) has been implemented to protect the routing information. The security associations between source node and destination node and also between the nodes are established, when they are in the coverage area of each other, by exchanging appropriate information. This security mechanism is based on Ad hoc On-demand Distance Vector (AODV) routing protocol for ad hoc networks. The results show that in a mobile adhoc network, the Triple Hash Technique provides secure routing even in the presence of malicious nodes.

Keywords

Ad Hoc Network, AODV, Authentication, Triple Hash Technique.

Full Text

     

T. Malarvizhi ¹, M. Pushpavalli ², A. M. Natarajan ³

Affiliations
1 Department of Applied Electronics, Bannari Amman Institute of Technology, Sathyamangalam, IN
2 Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, Sathyamangalam, IN
3 Bannari Amman Institute of Technology, Sathyamangalam, IN

Abstract

The Quality of Service (QoS) requirements is technically a challenging issue for routing in MANETs. Due to more internal traffic load in the network and by the injection of more QoS sensitive traffic the current flows and already existed flows cause performance degradation. With the QoS aware routing protocol (AODV) a novel differentiated service model is proposed here and it introduces the appropriate routing metrics like available bandwidth and delay. With the bandwidth estimation it introduces admission control as a part    of the scheme. Our work is investigated with examples for better results with controlled admitted flows and less delay is achieved.

Keywords

QoS, MANETs, Diffserv, Bandwidth Estimation.

Full Text

     

M. Pushpavalli ¹, T. Malarvizhi ², A. M. Natarajan ³

Affiliations
1 Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, Sathyamangalam, IN
2 Department of Applied Electronics, Bannari Amman Institute of Technology, Sathyamangalam, IN
3 Bannari Amman Institute of Technology, Sathyamangalam, IN

Abstract

The Quality of Service (QoS) requirements is technically a challenging issue for routing in MANETs. Due to more internal traffic load in the network and by the injection of more QoS sensitive traffic the current flows and already existed flows cause performance degradation. With the QoS aware routing protocol (AODV) a novel differentiated service model is proposed here and it introduces the appropriate routing metrics like available bandwidth and delay. It provides fast and efficient QoS support while maintaining adapted flexibility and minimizing wasted reservations. With the bandwidth estimation it introduces admission control as a part of the scheme. Our work is investigated with examples for better results with controlled admitted flows and less delay is achieved.

Keywords

QoS, MANETs, Diffserv, Bandwidth Estimation.

Full Text

     

R. Priya Vaijayanthi ¹, A. M. Natarajan ¹

Affiliations
1 Department of Computer Science and Engineering, Bannari Amman Institute of Technology, Sathyamangalam-638401, Tamil Nadu, IN

Abstract

In recent years it is required to store/retrieve a huge quantum of documents across network in World Wide Web (WWW) due to the wide spread usage of computers across the globe. This has placed many challenges to the Information Retrieval (IR) system like fetching of relevant documents matching with user’s query, classification of electronic documents etc. Clustering is an unsupervised learning that partitions the available documents into several clusters based on the similarity between the documents. The problem of clustering has become a combinatorial optimization problem in IR system due to the exponential growth in information over WWW. In this paper, a novel Hybrid Ant Algorithm, a blended scheme of Tabu Search and Ant Colony Optimization algorithm has been proposed to form better quality clusters with documents of similar features. The viability of the proposed algorithm is tested over ma few standard benchmark datasets and the numerical experimental results reveal that the proposed algorithm yields promising quality clusters compared to other ones produced by K-means algorithm.

Keywords

Ant Colony, Document Clustering, Meta-Heuristic, Optimization.

Full Text

     

A. Bharathi ¹, A. M. Natarajan ²

Affiliations
1 Anna University, Coimbatore, IN
2 Bannari Amman Institute of Technology, Sathyamangalam, IN

Abstract

Clustering is one of the major tasks in data mining Clustering algorithms are based on a criterion that maximizes inter cluster distance and minimize intra cluster distance. In higher dimensional feature spaces, the performance and efficiency deteriorates to a greater extent. Large dimensions confuse the clustering algorithms and it is difficult to group similar data points becomes almost the same and is usually called as the “dimensionality curse” problem. These algorithms find a subset of dimensions by removing irrelevant and redundant dimensions on which clustering is performed. Dimensionality reduction technique such as Principal Component Analysis (PCA) is used for feature reduction. If different subsets of the points cluster well on different subspaces of the feature space, a global dimensionality reduction will fail. To overcome these problems, recent directions in research proposed to compute subspace cluster. The algorithms have two common limitations. First, they usually have problems with subspace clusters of different dimensionality. Second, they often fail to discover clusters of different shape and dimensionalities. The goal of this project is to develop new efficient and effective methods for high dimensional clustering.

Keywords

Data Mining, High Dimensional Clustering, Distance Measure.

Full Text

     

R. Asokan ¹, A. M. Natarajan ²

Affiliations
1 Electronics and Communication Engineering Department, Kongu Engineering College, Perundurai, Erode, Tamilnadu, IN
2 Bannari Amman Institute of Technology, Sathiyamangalam, Tamilnadu, IN

Abstract

Mobile Ad hoc NETworks (MANETs) are collection of mobile hosts dynamically forming a temporary network without the aid of any existing infrastructure or centralized control. Quality of Service (QoS) support for MANET is a challenging task due to the dynamic topology and limited resources. Routing in MANET depends on intermediate nodes. The existing QoS based routing solutions for MANET involves with single metric or two metrics. It is important that MANETs should provide QoS support routing such as acceptable delay, jitter and energy in case of multimedia and real time applications. The metrics selection can be from additive or multiplicative or concave or combination of the above. This paper proposes a QoS enabled Temporally Ordered Routing Algorithm (TORA) protocol using Ant Colony Optimization (ACO) called AntTORA. ACO technique is used in this protocol to optimize multiple QoS routing metrics like delay, jitter and energy. Ant-like agents are used in this algorithm to discover and maintain paths with the specified QoS requirements. The performance of TORA and AntTORA are analyzed using network simulator-2. AntTORA produces better performance than TORA in the terms of end-to-end delay, energy, jitter and throughput.

Keywords

Mobile Ad Hoc Network, Routing, QoS, TORA and AntTORA.

Full Text

     

K. Premalatha ¹, A. M. Natarajan ¹

Affiliations
1 Bannari Amman Institute of Technology, Tamil Nadu, IN

Abstract

Document clustering algorithms play an important task towards the goal of organizing huge amounts of documents into a small number of significant clusters. Traditional clustering algorithms will search only a small sub-set of possible clustering and as a result, there is no guarantee that the solution found will be optimal. This paper presents different representation of particle in Particle Swarm Optimization (PSO) for document clustering. Experiments results are examined with document corpus. It demonstrates that the Discrete PSO algorithm statistically outperforms the Binary PSO and Simple PSO for document Clustering.

Keywords

Particle Swarm Optimization, Document Clustering, Inertia Weight, Constriction Factor, Swarm Intelligence.

Full Text

     

Venkat Rohini ¹, A. M. Natarajan ²

Affiliations
1 Christ University, Hosur Road, Bangalore - 560029, Karnataka, IN
2 Bannari Amman Institute of Technology, Alathukombai Post, Erode District, Sathyamangalam - 638401, Tamil Nadu, IN

Abstract

Objectives: Planning and allocation of the various resources according to the constraints is a hilarious task. The paper aims to find a suitable method to solve the university course scheduling problem. Methods and Statistical Analysis: This paper compares the usage of Particle Swarm Optimisation (PSO), Ant Colony Optimisation (ACO), Tabu Search and Genetic Algorithm (GA) in the preparation of University Course Scheduling System. Certain hard constraints, which has to be satisfied and some soft constraints that can be satisfied are considered. Findings: The algorithm should check for the satisfaction of the hard constraints and the possibility of satisfying the soft constraints. Application/Improvements: The performance of the suitable method is found by comparing with the other methods based on various parameters.

Keywords

Ant Colony Optimisation, Genetic Algorithm, Hard Constraint, Particle Swarm Optimisation, Soft Constraint, Tabu Search.

Full Text